Lecture 17 : Feedback , Joint Source Channel Coding , Continuous Channel
نویسنده
چکیده
If we consider codes that are not necessarily uniquely decodable, then we can encode above the information capacity of the channel. It is important to note however that the probability of error for non-uniquely decodable codes when transmitting strings of source symbols can never approach 0. Consider the following example, we have a binary symmetric channel with cross over problem as shown in Figure 17.1 with corresponding channel code defined in Table 17.1.
منابع مشابه
Bounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملLecture Notes on Information Theory Volume I by Po
Preface The reliable transmission of information bearing signals over a noisy communication channel is at the heart of what we call communication. Information theory—founded by Claude E. Shannon in 1948—provides a mathematical framework for the theory of communication; it describes the fundamental limits to how efficiently one can encode information and still be able to recover it with negligib...
متن کاملPerformance Analysis of Multiresolution Joint Source-Channel Coding for Mobile Radio Channels with feedback
In this paper, we analyze the performance of a novel multiresolution joint source and channel coding (MR-JSCC) scheme for mobile radio channels with feedback. The transmitter and receiver can match the resolution of each other synchronously, according to the channel state information (CSI). Bandwidth requirement could be met by carefully adjusting the resolution thresholds. The threshold determ...
متن کاملError Exponents for Joint Source-Channel Coding with Delay-Constraints
Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases w...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012